Distributed algorithm for approximating the maximum matching
نویسندگان
چکیده
We present a distributed algorithm that finds a matching M of size which is at least 2/3|M | where M ∗ is a maximum matching in a graph. The algorithm runs in O(log n) steps.
منابع مشابه
A Fast Distributed Algorithm for Approximating the Maximum Matching
We present a distributed approximation algorithm that computes in every graph G a matching M of size at least 2 3 β(G), where β(G) is the size of a maximum matching in G. The algorithm runs in O(log |V (G)|) rounds in the synchronous, message passing model of computation and matches the best known asymptotic complexity for computing a maximal matching in the same protocol. This improves the run...
متن کاملOn the inverse maximum perfect matching problem under the bottleneck-type Hamming distance
Given an undirected network G(V,A,c) and a perfect matching M of G, the inverse maximum perfect matching problem consists of modifying minimally the elements of c so that M becomes a maximum perfect matching with respect to the modified vector. In this article, we consider the inverse problem when the modifications are measured by the weighted bottleneck-type Hamming distance. We propose an alg...
متن کاملSimple Round Compression for Parallel Vertex Cover
Recently, Czumaj et al. (arXiv 2017) presented a parallel (almost) 2-approximation algorithm for the maximum matching problem in only O ( (log logn) ) rounds of the massive parallel computation (MPC) framework, when the memory per machine is O(n). The main approach in their work is a way of compressing O(log n) rounds of a distributed algorithm for maximum matching into only O ( (log logn) ) MP...
متن کاملApproximating the step change point of the process fraction non conforming using genetic algorithm to optimize the likelihood function
Control charts are standard statistical process control (SPC) tools for detecting assignable causes. These charts trigger a signal when a process gets out of control but they do not indicate when the process change has begun. Identifying the real time of the change in the process, called the change point, is very important for eliminating the source(s) of the change. Knowing when a process has ...
متن کاملTight Bounds for Linear Sketches of Approximate Matchings
We resolve the space complexity of linear sketches for approximating the maximum matching problem in dynamic graph streams where the stream may include both edge insertion and deletion. Specifically, we show that for any ǫ > 0, there exists a one-pass streaming algorithm, which only maintains a linear sketch of size Õ(n) bits and recovers an n-approximate maximum matching in dynamic graph strea...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Applied Mathematics
دوره 143 شماره
صفحات -
تاریخ انتشار 2004